Atomistic Global Optimization X: A Python package for optimization of atomistic structures

Modelling and understanding properties of materials from first principles require knowledge of the underlying atomistic structure. This entails knowing the individual identity and position of all involved atoms. Obtaining such information for macro-molecules, nano-particles, clusters, and for the surface, interface, and bulk phases of amorphous and solid materials represents a difficult high dimensional global optimization problem. The rise of machine learning techniques in materials science has, however, led to many compelling developments that may speed up such structure searches. The complexity of the new methods have established the necessity for an efficient way of experimenting with and assembling them into global optimization algorithms. In this paper we introduce the Atomistic Global Optimization X (AGOX) framework and code, as a customizable approach to building efficient global optimization algorithms. A modular way of expressing global optimization algorithms is described and modern programming practices are used to enable that modularity in the freely available AGOX python package. Two examples of global optimization problems are analyzed: One that is computationally inexpensive which is used to showcase that AGOX enables the expression of multiple global optimization algorithms. As the other example, AGOX is used for solving a complex atomistic optimization problem for a metal-nitride nano-cluster embedded in a graphene sheet as described at the density functional theory (DFT) level.Comment: 12 pages, 11 figure

To Du or not to Du: A Security Analysis of Du-Vote

International audienceDu-Vote is a recently presented remote electronic voting scheme. Its goal is to be malware tolerant, i.e., provide security even in the case where the platform used for voting has been compromised by dedicated malware. For this it uses an additional hardware token, similar to tokens distributed in the context of online banking. The token is software closed and does not have any communication means other than a numerical keyboard and a small display. Du-Vote aims at providing vote privacy as long as either the vote platform or the vote server is honest. For verifiability, the security guarantees are even higher, as even if the token's software has been changed, and the platform and the server are colluding, attempts to change the election outcome should be detected with high probability. In this paper we provide an extensive security analysis of Du-Vote and show several attacks on both privacy as well as verifiability. We also propose changes to the system that would avoid many of these attacks

Correspondences between WZNW models and CFTs with W -algebra symmetry

We study theories with W-algebra symmetries and their relation to WZNW models on (super-)groups. Correlation functions of the WZNW models are expressed in terms of correlators of CFTs with W-algebra symmetry. The symmetries of the theories involved in these correspondences are related by the Drinfeld-Sokolov reduction of Lie algebras to W-algebras. The W-algebras considered in this paper are the Bershadsky-Polyakov algebra for sl(3) and the quasi-superconformal algebra for generic sl(N |M). The quantum W-algebras obtained from affine sl(N) are constructed using embeddings of sl(2) into sl(N), and these can in turn be characterized by partitions of N. The above cases correspond to N + 2 = 2 + N 1 and its supergroup extension. Finally, sl(2N) and the correspondence corresponding to 2N = N 2 is also analyzed

On the Possibility of Non-Interactive E-Voting in the Public-key Setting

In 2010 Hao, Ryan and Zielinski proposed a simple decentralized e-voting protocol that only requires 2 rounds of communication. Thus, for k elections their protocol needs 2k rounds of communication. Observing that the first round of their protocol is aimed to establish the public-keys of the voters, we propose an extension of the protocol as a non-interactive e-voting scheme in the public-key setting (NIVS) in which the voters, after having published their public-keys, can use the corresponding secret-keys to participate in an arbitrary number of one-round elections. We first construct a NIVS with a standard tally function where the number of votes for each candidate is counted. Further, we present constructions for two alternative types of elections. Specifically in the first type (dead or alive elections) the tally shows if at least one voter cast a vote for the candidate. In the second one (elections by unanimity), the tally shows if all voters cast a vote for the candidate. Our constructions are based on bilinear groups of prime order. As definitional contribution we provide formal computational definitions for privacy and verifiability of NIVSs. We conclude by showing intriguing relations between our results, secure computation, electronic exams and conference management systems

Preservation of DNA Privacy During the Large Scale Detection of COVID-19

As humanity struggles to contain the global COVID-19 pandemic, privacy concerns are emerging regarding confinement, tracing and testing. The scientific debate concerning privacy of the COVID-19 tracing efforts has been intense, especially focusing on the choice between centralised and decentralised tracing apps. The privacy concerns regarding COVID-19 testing, however, have not received as much attention even though the privacy at stake is arguably even higher. COVID-19 tests require the collection of samples. Those samples possibly contain viral material but inevitably also human DNA. Patient DNA is not necessary for the test but it is technically impossible to avoid collecting it. The unlawful preservation, or misuse, of such samples at a massive scale may hence disclose patient DNA information with far-reaching privacy consequences. Inspired by the cryptographic concept of "Indistinguishability under Chosen Plaintext Attack", this paper poses the blueprint of novel types of tests allowing to detect viral presence without leaving persisting traces of the patient's DNA. Authors are listed in alphabetical order.Comment: 10 pages, 1 figur

The FZZ duality with boundary

The Fateev-Zamolodchikov-Zamolodchikov (FZZ) duality relates Witten’s cigar model to sine-Liouville theory. This duality was proven in the path integral formulation and extended to the case of higher genus closed Riemann surfaces by Schomerus and one of the authors. In this note we further extend the duality to the case with boundary. Specifically, we relate D1-branes in the cigar model to D2-branes in the sine-Liouville theory. In particular, the boundary action for D2-branes in the sine-Liouville theory is constructed. We also consider the fermionic version of the FZZ duality. This duality was proven as a mirror symmetry by Hori and Kapustin, but we give an alternative proof in the path integral formulation which directly relates correlation functions. Also here the case with boundary is investigated and the results are consistent with those for branes in $\mathcal{N} = 2$ super Liouville field theory obtained by Hosomichi